Improved Algorithm for the Network Alignment Problem with Application to Binary Diffing

In this paper, we present a novel algorithm to address the Network Alignment problem. It is inspired from previous message passing framework of Bayati et al. [2] and includes several modifications designed significantly speed up updates as well enforce their convergence. Experiments show that our proposed model outperforms other state-of-the-art solvers. Finally, propose an application method in order Binary Diffing We solution provides better assignment than reference differs almost all submitted instances outline importance leveraging graphical structure binary programs.